SIMPLE GROUPS STABILIZING POLYNOMIALS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple Groups Stabilizing Polynomials

We study the problem of determining, for a polynomial function f on a vector space V , the linear transformations g of V such that f ◦ g = f . When f is invariant under a simple algebraic group G acting irreducibly on V , we note that the subgroup of GL(V ) stabilizing f often has identity component G, and we give applications realizing various groups, including the largest exceptional group E8...

متن کامل

Orthogonal Polynomials of Compact Simple Lie Groups

Recursive algebraic construction of two infinite families of polynomials in n variables is proposed as a uniform method applicable to every semisimple Lie group of rank n. Its result recognizes Chebyshev polynomials of the first and second kind as the special case of the simple group of type A1. The obtained not Laurent-type polynomials are equivalent to the partial cases of theMacdonald symmet...

متن کامل

Permutation Groups and Polynomials

Given a set S with n elements, consider all the possible one-to-one and onto functions from S to itself. This collection of functions is called the permutation group of S, because the functions are simply permuting the elements of S. We notice immediately that it doesn’t matter what the elements of S are (numbers, planets, tacos, etc) just that there are n distinct ones in the set, so we may re...

متن کامل

Extremal Polynomials in Stratified Groups

We introduce a family of extremal polynomials associated with the prolongation of a stratified nilpotent Lie algebra. These polynomials are related to a new algebraic characterization of abnormal subriemannian geodesics in stratified nilpotent Lie groups. They satisfy a set of remarkable structure relations that are used to integrate the adjoint equations.

متن کامل

Synthesis of a simple self-stabilizing system

With the increasing importance of distributed systems as a computing paradigm, a systematic approach to their design is needed. Although the area of formal verification has made enormous advances towards this goal, the resulting functionalities are limited to detecting problems in a particular design. By means of a classical example, we illustrate a simple template-based approach to computeraid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Forum of Mathematics, Pi

سال: 2015

ISSN: 2050-5086

DOI: 10.1017/fmp.2015.3